Approximation and Exactness in Finite State Optimality Theory

نویسندگان

  • Dale Gerdemann
  • Gertjan van Noord
چکیده

Previous work (Frank and Satta, 1998; Karttunen, 1998) has shown that Optimality Theory with gradient constraints generally is not finite state. A new finite-state treatment of gradient constraints is presented which improves upon the approximation of Karttunen (1998). The method turns out to be exact, and very compact, for the syllabification analysis of Prince and Smolensky (1993).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Least-Squares Finite Element Methods for Optimality Systems Arising in Optimization and Control Problems

The approximate solution of optimization and optimal control problems for systems governed by linear, elliptic partial differential equations is considered. Such problems are most often solved using methods based on applying the Lagrange multiplier rule to obtain an optimality system consisting of the state system, an adjoint-state system, and optimality conditions. Galerkin methods applied to ...

متن کامل

On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces

Abstract. Calculating optimal policies is known to be computationally difficult for Markov decision processes with Borel state and action spaces and for partially observed Markov decision processes even with finite state and action spaces. This paper studies finite-state approximations of discrete time Markov decision processes with Borel state and action spaces, for both discounted and average...

متن کامل

Practical Finite State Optimality Theory

Previous work for encoding Optimality Theory grammars as finite-state transducers has included two prominent approaches: the socalled ‘counting’ method where constraint violations are counted and filtered out to some set limit of approximability in a finite-state system, and the ‘matching’ method, where constraint violations in alternative strings are matched through violation alignment in orde...

متن کامل

A Finite-State Approximation of Optimality Theory: The Case of Finnish Prosody

This paper gives a finite-state formulation of two closely related descriptions of Finnish prosody proposed by Paul Kiparsky and Nine Elenbaas in the framework of optimality theory. In native Finnish words, the primary stress falls on the first syllable. Secondary stress generally falls on every second syllable. However, secondary stress skips a light syllable that is followed by a heavy syllab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cs.CL/0006038  شماره 

صفحات  -

تاریخ انتشار 2000